Structured Query Language with Recursion

نویسندگان

  • Raj Gupta
  • Oleksiy Syrotkin
  • Oleg Sokolsky
چکیده

Writing recursive queries for a database is currently a complicated task. The query requires the user to write complex and redundant SQL syntax. Also if the database being used as a backend is not compliant with SQL:1999 then it is not possible to write any recursive queries. In this paper, we present Structured Query Language with Recursion (SQLR), a data retrieval language used for writing recursive queries for any relational database, e.g. MySQL, Oracle, DB2, even the ones not using SQL:1999. We have also developed a Java package, which can be used to send recursive queries to a database (using the language presented), and receive the requested information from the database. Hence we have developed a very flexible and non-intrusive system to run recursive queries, without having to change the underlying database in any way. We have specifically tested the language on the CiteSeer database (http://citeseer.ist.psu.edu). The database was chosen because it is possible to transform it into a graph and recursive queries on this database will be useful for future research.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Querying Proofs

We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hierarchical nested labelled trees. The core language presented in this paper is locally structured, with queries built using recursion and patterns over proof structure and rule names. We define the syntax and semantics o...

متن کامل

TQL Algebra and its Implementation

TQL is a query language for semi-structured data. TQL binding mechanism is based upon the ambient logic. This binding mechanism is the key feature of TQL, but its implementation is far from obvious, being based on a logic which includes “difficult” operators such as negation, universal quantification, recursion, and new tree-related operators. In [6] an “implementation model” is presented, here...

متن کامل

A Rule-Based Query Language for HTML

With the recent popularity of the web, enormous amount of information is now available on line. Most web documents available over the web are in HTML format and are hierarchically structured in nature. How to query such web documents based on their internal hierarchical structure becomes more and more important. In this paper, we present a rule-based language called WebQL to support effective a...

متن کامل

ROSA: A Data Model and Query Language for e-Learning Objects

Learning Content Management Systems (LCMS) supports e-learning applications with storage and efficient access for e-learning objects (LO)s. ROSA is a LCMS built as a semantic layer on the top of an XML native DBMS, Tamino. Together, ROSA and Tamino, offer instructional designers a semantic view of e-learning content. In this paper, we present ROSA Data Model and Query Language, designed as an e...

متن کامل

New Query Rewriting Methods for Structured and Semi-Structured Databases

The following thesis presents novel optimization methods for structured and semi-structured databases. Developed methods are based on query rewriting and focus on reduction of various resources consumption during query execution. The first method achieves this goal by rewriting the initial query execution plan into a new plan based on the reduce function. The second method utilizes distributivi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007